Moments of Inertia Associated with the Lozenge Tilings of a Hexagon
نویسنده
چکیده
Let a, b and c be positive integers and consider a hexagon with side lengths a,b,c,a,b,c whose angles are 120 (see Figure 1). The subject of our interest is lozenge tilings of such a hexagon using lozenges with all sides of length 1 and angles of 60 and 120. Figure 2 shows an example of a lozenge tiling of a hexagon with a = 3, b = 5 and c = 4. We introduce the following oblique angled coordinate system: Its origin is located in one of the two vertices, where sides of length b and c meet, and the axes are induced by those two sides (see Figure 3). The units are chosen such that the side lengths of the considered hexagon are √ 2a, b, c, √ 2a, b, c in this coordinate system. (That is to say, the two triangles in Figure 3 with vertices in the origin form the unit ‘square’.) Let Pa,b,c(x, y) denote the probability that an arbitrary chosen lozenge tiling of the hexagon with side lengths a,b,c,a,b,c contains the horizontal lozenge with lowest vertex (x, y) in the oblique angled coordinate system. Note that S = ((a + b)/2, (a + c)/2) is the centre of the hexagon in question. Consider the probability Pa,b,c(x, y) as if it described the distribution of mass. In [1, Problem 7] Propp suggests to compute the horizontal moment of inertia with respect to S
منابع مشابه
The Number of Centered Lozenge Tilings of a Symmetric Hexagon
Abstract. Propp conjectured [15] that the number of lozenge tilings of a semiregular hexagon of sides 2n − 1, 2n − 1 and 2n which contain the central unit rhombus is precisely one third of the total number of lozenge tilings. Motivated by this, we consider the more general situation of a semiregular hexagon of sides a, a and b. We prove explicit formulas for the number of lozenge tilings of the...
متن کاملEnumeration of Tilings of Quartered Aztec Rectangles
We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-GesselViennot methodology to find the number of tilings of a quartered lozenge hexagon.
متن کاملEnumeration of tilings of a hexagon with a maximal staircase and a unit triangle removed
In 1988, Proctor presented a result on plane partitions which implied a formula for the number of lozenge tilings of a hexagon with side-lengths a, b, c, a, b, c after removing a “maximal staircase.” More recently, Ciucu proved a weighted version of Proctor’s result. Here we present weighted and unweighted formulas for a similar region which has an additional unit triangle removed. We use Kuo’s...
متن کاملEnumeration of Lozenge Tilings of Punctured Hexagons
We present a combinatorial solution to the problem of determining the number of lozenge tilings of a hexagon with sides a, b + 1, b, a + 1, b, b + 1, with the central unit triangle removed. For a = b, this settles an open problem posed by Propp 7]. Let a, b, c be positive integers, and denote by H the hexagon whose side-lengths are (in cyclic order) a, b, c, a, b, c and all whose angles have 12...
متن کاملEnumeration of Lozenge Tilings of Halved Hexagons with a Boundary Defect
We generalize a special case of a theorem of Proctor on the enumeration of lozenge tilings of a hexagon with a maximal staircase removed, using Kuo’s graphical condensation method. Additionally, we prove a formula for a weighted version of the given region. The result also extends work of Ciucu and Fischer. By applying the factorization theorem of Ciucu, we are also able to generalize a special...
متن کامل